package NiuKe;

import java.util.Arrays;
import java.util.Scanner;

/**
 * 阿里的笔试题
 */
public class Alibaba {
    public static void main(String[] args) {
        Alibaba t = new Alibaba();
        Scanner input = new Scanner(System.in);//标准输入
        int n = input.nextInt();
        System.out.println(n);
        System.out.println(input.nextLine());
        String str = input.nextLine();
        /*int []array = t.getArray(str);//获取数组
        System.out.println(t.solve(array,n));//输出结果*/
    }
    public int[] getArray(String str){//获取数组
        String []strings = str.split(" ");//根据空格分隔
        int n = strings.length;
        int array[] = new int[n];
        for (int i = 0 ; i < n ; i++){
            array[i] = Integer.parseInt(strings[i]);//获取每一个元素
        }
        Arrays.sort(array);//数组元素从小到大排序
        return  array;
    }

    public int solve(int []array  , int n ){

        while(n-1 > 0){
            for (int i = 0 ; i < n ; i++){
                if(i == n-1){
                    array[i] = 0;
                }else {
                    array[i] = array[i+1] - array[i];
                }
            }
            n--;
        }

        int max = 0;
        for(int j = 0; j < n ; j++){
            if (array[j] > max){
                max = array[j];
            }
        }

        return max % (1000000007);
    }




}
